The santalo point of a planar convex set

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the convex hull of a planar point set

In Figure 1, the set S consists of thirteen points. The output of a convex hull algorithm should be the list (p1, p2, p3, p4, p5, p6). We remark that the list storing the vertices of CH (S) can start with an arbitrary vertex. In the example, the list (p3, p4, p5, p6, p1, p2) would also be a valid output. ∗School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6. E-mail: ...

متن کامل

On the number of disjoint convex quadrilaterals for a planar point set

For a given planar point set P , consider a partition of P into disjoint convex polygons. In this paper, we estimate the maximum number of convex quadrilaterals in all partitions.  2001 Elsevier Science B.V. All rights reserved.

متن کامل

Coloring copoints of a planar point set

To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gons in the point set. We prove an upper bound of 2k−1 on the size of a planar point set for which the graph has chromatic number k, matching the bound conjectured by Szekeres for the clique number. Constructions of Erdős...

متن کامل

On the convex layers of a planar set

Let S be a set of n points in the Euclidean plane. The convex layers of S are the convex polygons obtained by iterating on the following procedure: compute the convex hull of S and remove its vertices from S. This process of peeling a planar point set is central in the study of robust estimators in statistics. It also provides valuable information on the morphology of a set of sites and has pro...

متن کامل

On the Rectilinear Convex Layers of a Planar Set

In this paper we give an optimal O(n log n) time and O(n) space algorithm to compute the rectilinear convex layers of a set S of n points on the plane. We also compute the rotation of S that minimizes the number of rectilinear convex layers in O(n log n) time and O(n) space.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 1993

ISSN: 0893-9659

DOI: 10.1016/0893-9659(93)90011-b